Multi-level OT

نویسنده

  • Dirk-Bart den Ouden
چکیده

Since the early 1990s, Optimality Theory (OT) has quickly gained ground in phonology. Its main appeal lies in two characteristics: the focus on wellformedness of the output and the softness of constraints, where a constraint can be violated in order to satisfy more important requirements. A conspicuous characteristic of classic OT is that all constraints on the output should compete with each other at all times. This basically means that the ‘construction’ of the output occurs in one step. OT is therefore minimally derivational, the only derivation being that from the input to the output. Mainly on the basis of data from aphasic speakers, I argue that the ‘one-step’ variant of OT lacks psychological validity and that it is better to assume that the OT algorithm plays a role in determining (phonological) structure at different cognitive levels of processing, at least in production.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-level OT: An argument from speech pathology

Since the early 1990s, Optimality Theory (OT) has quickly gained ground in phonology. Its main appeal lies in two characteristics: the focus on wellformedness of the output and the softness of constraints, where a constraint can be violated in order to satisfy more important requirements. A conspicuous characteristic of classic OT is that all constraints on the output should compete with each o...

متن کامل

Improved OT Extension for Transferring Short Secrets and Application to Secure Multi-Party Computation

We propose an optimization and generalization of OT extension of Ishai et al. of Crypto 2003. For computational security parameter k, our OT extension for short secrets o↵ers O(log k) factor performance improvement in communication and computation, compared to prior work. In concrete terms, for today’s security parameters, this means approx. factor 2-3 improvement. This results in corresponding...

متن کامل

Fastplay-A Parallelization Model and Implementation of SMC on CUDA based GPU Cluster Architecture

We propose a four-tiered parallelization model for acceleration of the secure multiparty computation (SMC) on the CUDA based Graphic Processing Unit (GPU) cluster architecture. Specification layer is the top layer, which adopts the SFDL of Fairplay for specification of secure computations. The SHDL file generated by the SFDL compiler of Fairplay is used as inputs to the function layer, for whic...

متن کامل

Statistical Impossibility Results for Oblivious Transfer Reductions

Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditionally secure way, but there are many reductions of OT to other variants of OT, as well as other primitives such as noisy channels. It is important to know how efficient such unconditionally secure reductions can be in pr...

متن کامل

Improved OT Extension for Transferring Short Secrets

We propose an optimization and generalization of OT extension of Ishai et al. of Crypto 2003. For computational security parameter k, our OT extension for short secrets offers O(log k) factor performance improvement in communication and computation, compared to prior work. In concrete terms, for today’s security parameters, this means approx. factor 2-3 improvement. This results in correspondin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004